- 最低成本路徑
- minimum: n. (pl. minimums, -ma ) 最小，最 ...
- cost: n. 1.費用；代價，價格；成本。 2.犧牲；損害，損失 ...
- path: n. (pl. paths ) 1.(自然踏成的)路；路 ...
- cost，minimum: 最低成本
- minimum cost: 最小代價, 最低成本
下載手機詞典可隨時隨地查詞查翻譯
minimum cost path中文什么意思
- 最低成本路徑
下載手機詞典可隨時隨地查詞查翻譯
例句與用法
- After analysis of existing heuristic , four new heuristics for solve steiner problem which are kbmph ( key - node based minimum cost paths heuristic ) algorithm , kbmph , algorithm , kddmc ( key - node and destination driven multicast routing ) algorithm and wddmc ( weighted destination driven multicast routing ) algorithm are presented
在分析比較了已有的典型的啟發(fā)式算法基礎上，提出了四種steiner樹的啟發(fā)式算法： kbmph算法、 kbmph _ 1算法、 kddmc算法和wddmc算法。 - One of constrained problem is delay constrained steiner tree problem . a heuristic dbma ( delay - bounded multicast routing algorithm ) based on minimum delay path set and minimum cost path set is proposed . simulation result demonstrate that it is a delay constrained algorithm with low time complexity and low cost
首先是時延約束的最小steiner樹問題，在比較了現(xiàn)有的算法以后，提出了一種基于最短時延路徑集和最小費用路徑集的多播路由算法? ? dbma算法，仿真結果表明該算法是一種低復雜度的時延約束低費用多播路由算法。 - The delay and delay variation constrained minimum steiner tree problem is also researched . lcdvma ( low - cost delay variation - constrained multicast algorithm ) is proposed for this problem . low time complexity , low cost and constrained delay and low delay variation are achieved by only comparing minimum delay paths and minimum cost paths
對于時延和時延差約束的最小steiner樹問題，提出了一種基于最小時延路徑和最小費用路徑的算法?一lcdvma算法，由于該算法比較了通過中轉(zhuǎn)節(jié)點后的最低費用路徑和最短時延路徑，降低了運算復雜度，通過仿真得到了較小的網(wǎng)絡費用和時延差，因此lcdvma算法是一種具有低復雜度的時延和時延差約束的最小steiner樹的啟發(fā)式算法。